Online stochastic optimization under time constraints
نویسندگان
چکیده
منابع مشابه
Online stochastic optimization under time constraints
This paper considers online stochastic combinatorial optimization problems where uncertainties, i.e., which requests come and when, are characterized by distributions that can be sampled and where time constraints severely limit the number of offline optimizations which can be performed at decision time and/or in between decisions. It proposes online stochastic algorithms that combine the frame...
متن کاملRegrets Only! Online Stochastic Optimization under Time Constraints
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/or in between decisions. It proposes a novel approach which combines the salient features of the earlier approaches: the evaluation of every decision on all samples (expectation) and the ability to avoid distributing t...
متن کاملOnline Convex Optimization with Stochastic Constraints
This paper considers online convex optimization (OCO) with stochastic constraints, which generalizes Zinkevich’s OCO over a known simple fixed set by introducing multiple stochastic functional constraints that are i.i.d. generated at each round and are disclosed to the decision maker only after the decision is made. This formulation arises naturally when decisions are restricted by stochastic e...
متن کاملOnline Decision Making under Stochastic Constraints
This paper proposes a novel algorithm for solving discrete online learning problems under stochastic constraints, where the leaner aims to maximize the cumulative reward given that some additional constraints on the sequence of decisions need to be satisfied on average. We propose Lagrangian exponentially weighted average (LEWA) algorithm, which is a primal-dual variant of the well known expone...
متن کاملStochastic Combinatorial Optimization under Probabilistic Constraints
In this paper, we present approximation algorithms for combinatorial optimization problems under probabilistic constraints. Specifically, we focus on stochastic variants of two important combinatorial optimization problems: the k-center problem and the set cover problem, with uncertainty characterized by a probability distribution over set of points or elements to be covered. We consider these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2009
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-009-0605-5